L∞-Norm Computation for Continuous-Time Descriptor Systems Using Structured Matrix Pencils
نویسندگان
چکیده
In this technical note, we discuss an algorithm for the computation of the L∞-norm of transfer functions related to descriptor systems. We show how one can achieve this goal by computing the eigenvalues of certain skew-Hamiltonian/Hamiltonian matrix pencils and analyze arising problems. We also formulate and prove a theoretical result which serves as a basis for testing a transfer function matrix for properness. Finally, we illustrate our results using a descriptor system related to mechanical engineering.
منابع مشابه
Robust and Efficient Algorithms for L<sub></sub>-Norm Computation for Descriptor Systems
In this paper we discuss algorithms for the computation of the L∞-norm of transfer functions related to descriptor systems, both in the continuousand discrete-time context. We show how one can achieve this goal by computing the eigenvalues of certain structured matrix pencils. These pencils can be transformed to skew-Hamiltonian/Hamiltonian matrix pencils which are constructed by only using the...
متن کاملRobust and Efficient Algorithms for L∞ -Norm Computation for Descriptor Systems
In this paper we discuss algorithms for the computation of the L∞-norm of transfer functions related to descriptor systems, both in the continuousand discrete-time context. We show how one can achieve this goal by computing the eigenvalues of certain structured matrix pencils. These pencils can be transformed to skew-Hamiltonian/Hamiltonian matrix pencils which are constructed by only using the...
متن کاملL∞-Norm Computation for Large-Scale Descriptor Systems Using Structured Iterative Eigensolvers
In this report, we implement a method for computing L∞-norms for descriptor systems using structured iterative eigensolvers. In particular, the algorithm computes some desired imaginary eigenvalues of an even matrix pencil and uses them to determine an upper and lower bound to the L∞-norm. We finally compare our method to a previously developed algorithm using structured pseudospectra. Numerica...
متن کاملAn Arithmetic for Rectangular Matrix Pencils
This presentation is a generalization of 8] from square, regular n-by-n, pencils to singular and rectangular m-by-n pencils. We deene arithmetic-like operations on matrix pencils that are a natural extension of sums, products and quotients of real numbers. The algebra of linear transformations may be regarded as a special case of this pencil arithmetic. The language of linear relations leads to...
متن کاملDescriptor fractional linear systems with regular pencils
Methods for finding solutions of the state equations of descriptor fractional discrete-time and continuous-time linear systems with regular pencils are proposed. The derivation of the solution formulas is based on the application of the Z transform, the Laplace transform and the convolution theorems. Procedures for computation of the transition matrices are proposed. The efficiency of the propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Automat. Contr.
دوره 57 شماره
صفحات -
تاریخ انتشار 2012